翻訳と辞書
Words near each other
・ Backnang–Ludwigsburg railway
・ Backney Halt railway station
・ Backoffice
・ Backes & Strauss
・ Backety-Back Scenic Railway
・ Backfeeding
・ Backfire
・ Backfire (1950 film)
・ Backfire (1964 film)
・ Backfire (1988 film)
・ Backfire (album)
・ Backfire at the Disco
・ Backfire!
・ Backfired
・ Backfischroman
Backfitting algorithm
・ Backflip (disambiguation)
・ Backflip Studios
・ Backflow
・ Backflow prevention device
・ Backflush accounting
・ Backford
・ Backford Cross
・ Backford Hall
・ Backformed
・ Backgammon
・ Backgammon (album)
・ Backgammon (film)
・ Backgammon chouette
・ Backgammon match strategy


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Backfitting algorithm : ウィキペディア英語版
Backfitting algorithm
In statistics, the backfitting algorithm is a simple iterative procedure used to fit a generalized additive model. It was introduced in 1985 by Leo Breiman and Jerome Friedman along with generalized additive models. In most cases, the backfitting algorithm is equivalent to the Gauss–Seidel method algorithm for solving a certain linear system of equations
==Algorithm==
Additive models are a class of non-parametric regression models of the form:
: Y_i = \alpha + \sum_^p f_j(X_) + \epsilon_i
where each X_1, X_2, \ldots, X_p is a variable in our p-dimensional predictor X, and Y is our outcome variable. \epsilon represents our inherent error, which is assumed to have mean zero. The f_j represent unspecified smooth functions of a single X_j. Given the flexibility in the f_j, we typically do not have a unique solution: \alpha is left unidentifiable as one can add any constants to any of the f_j and subtract this value from \alpha. It is common to rectify this by constraining
: \sum_^N f_j(X_) = 0 for all j
leaving
: \alpha = 1/N \sum_^N y_i
necessarily.
The backfitting algorithm is then:

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Backfitting algorithm」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.